Applications of Discrepancy Theory in Multiobjective Approximation
نویسندگان
چکیده
We apply a multi-color extension of the Beck-Fiala theorem to show that the multiobjective maximum traveling salesman problem is randomized 1/2-approximable on directed graphs and randomized 2/3-approximable on undirected graphs. Using the same technique we show that the multiobjective maximum satisfiabilty problem is 1/2-approximable. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
Applications of Discrepancy Theory in Multiobjective Approximation unicode
We apply a multi-color extension of the Beck-Fiala theorem to show that the multiobjective maximum traveling salesman problem is randomized 1/2-approximable on directed graphs and randomized 2/3-approximable on undirected graphs. Using the same technique we show that the multiobjective maximum satisfiablilty problem is 1/2-approximable.
متن کاملBenson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملMultiobjective security game with fuzzy payoffs
A multiobjective security game problem with fuzzy payoffs is studied in this paper. The problem is formulated as a bilevel programming problem with fuzzy coefficients. Using the idea of nearest interval approximation of fuzzy numbers, the problem is transformed into a bilevel programming problem with interval coefficients. The Karush-Kuhn-Tucker conditions is applied then to reduce the problem ...
متن کاملNew Computational Aspects of Discrepancy Theory
OF THE DISSERTATION New Computational Aspects of Discrepancy Theory by Aleksandar Nikolov Dissertation Director: S. Muthukrishnan The main focus of this thesis work is computational aspects of discrepancy theory. Discrepancy theory studies how well discrete objects can approximate continuous ones. This question is ubiquitous in mathematics and computer science, and discrepancy theory has found ...
متن کاملStochastic Multiobjective Optimization: Sample Average Approximation and Applications
We investigate one stage stochastic multiobjective optimization problems where the objectives are the expected values of random functions. Assuming that the closed form of the expected values is difficult to obtain, we apply the well known Sample Average Approximation (SAA) method to solve it. We propose a smoothing infinity norm scalarization approach to solve the SAA problem and analyse the c...
متن کامل